Vehicle routing with probabilistic capacity constraints
نویسندگان
چکیده
منابع مشابه
Logistics Optimization: Vehicle Routing with Loading Constraints
In today’s global markets, enterprises are integrated in order to produce value for the end customers: this network is referred as Supply Chain (SC). Transportation Management (TM) is one of the SC processes. TM decisions include, among others, load planning (referred as Container Loading Problem CLP) and delivery route planning (referred as Vehicle Routing Problem VRP). Several authors address...
متن کاملA hybrid metaheuristic to solve the vehicle routing problem with stochastic demand and probabilistic duration constraints
The vehicle routing problem with stochastic demands and probabilistic distance constraints (VRPSD-PDC) can be defined on a complete and undirected graph G = (V, E), where V = {0, . . . , n} is the vertex set and E = {(v, u) : v, u ∈ V, v ̸= u} is the edge set. Vertices v = 1, . . . , n represent the customers and vertex v = 0 represents the depot. A distance de is associated with edge e = (v, u)...
متن کاملBranch-and-Price for Probabilistic Vehicle Routing
The Vehicle Routing Problem with Probabilistic Customers (VRP-PC) is a fundamental building block within the broad family of a priori routing models and has two decision stages. In the first stage, the dispatcher determines a set of vehicle routes serving all potential customer locations before the actual requests for service realize. In the second stage, vehicles are dispatched after observing...
متن کاملOligopoly with Capacity Constraints and Thresholds
Abstract Extended Oligopoly models will be introduced and examined in which the firms might face capacity limits, thresholds for minimal and maximal moves, and antitrust thresholds in the case of partial cooperation. Similar situation occurs when there is an additional cost of output adjustment, which is discontinuous at zero due to set-up costs. In these cases the payoff functions of the...
متن کاملMultiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest tour for the vehicle to transport all objects from their initial vertices to their destination vertices is called the vehicle routing problem. The problem is multiple capacity if the vehicle can handle more than one ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2018
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.04.010